Distance-regular Cayley graphs over dicyclic groups
نویسندگان
چکیده
The characterization of distance-regular Cayley graphs originates from the problem identifying strongly regular graphs, or equivalently, partial difference sets. In this paper, a classification on dicyclic groups is obtained. More specifically, it shown that every graph group complete graph, multipartite non-antipodal bipartite with diameter 3 satisfying some additional conditions.
منابع مشابه
Distance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملAutomorphisms of Cayley graphs on generalised dicyclic groups
A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs: abelian groups and generalised dicyclic groups [4]. Indeed, any Cayley graph on such a group admits specific additional graph automorphisms that depend only on the group...
متن کاملOn Classification of Extendability of Cayley Graphs on Dicyclic Groups
Let G be a group and S a subset of G such that the identity element 1 < S and x−1 ∈ S for each x ∈ S . The Cayley graph X(G; S ) on a group G has the elements of G as its vertices and edges joining g and gs for all g ∈ G and s ∈ S . A graph is said to be k-extendable if it contains k independent edges and any k independent edges can be extended to a perfect matching. In this paper, we prove tha...
متن کاملIntegral Cayley Graphs over Abelian Groups
Let Γ be a finite, additive group, S ⊆ Γ, 0 6∈ S, − S = {−s : s ∈ S} = S. The undirected Cayley graph Cay(Γ, S) has vertex set Γ and edge set {{a, b} : a, b ∈ Γ, a − b ∈ S}. A graph is called integral, if all of its eigenvalues are integers. For an abelian group Γ we show that Cay(Γ, S) is integral, if S belongs to the Boolean algebra B(Γ) generated by the subgroups of Γ. The converse is proven...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2022
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-022-01199-y